Typical Performance of Irregular Low-Density Generator-Matrix Codes for Lossy Compression
نویسنده
چکیده
We evaluate typical performance of irregular low-density generator-matrix (LDGM) codes, which is defined by sparse matrices with arbitrary irregular bit degree distribution and arbitrary check degree distribution, for lossy compression. We apply the replica method under one-step replica symmetry breaking (1RSB) ansatz to this problem. Typical performance of irregular LDGM codes for lossy compression 2
منابع مشابه
Iterative Algorithms For Lossy Source Coding
This thesis explores the problems of lossy source coding and information embedding. For lossy source coding, we analyze low density parity check (LDPC) codes and low density generator matrix (LDGM) codes for quantization under a Hamming distortion. We prove that LDPC codes can achieve the rate-distortion function. We also show that the variable node degree of any LDGM code must become unbounded...
متن کاملAnalysis of LDGM and compound codes for lossy compression and binning
Recent work has suggested that low-density generator matrix (LDGM) codes are likely to be effective for lossy source coding problems. We derive rigorous upper bounds on the effective rate-distortion function of LDGM codes for the binary symmetric source, showing that they quickly approach the rate-distortion function as the degree increases. We also compare and contrast the standard LDGM constr...
متن کاملMatching Code-on-Graph with Network-on-Graph: Adaptive Network Coding for Wireless Relay Networks
We consider user cooperation in a wireless relay network that comprises a collection of transmitters sending data to a common receiver through inherently unreliable and constantly changing channels. Exploiting the recently developed technology of network coding, we propose a new framework, termed adaptive network coded cooperation (ANCC), as a practical, de-centralized, adaptive and efficient c...
متن کاملLow-density graph codes that are optimal for source/channel coding and binning
We describe and analyze the joint source/channel coding properties of a class of sparse graphical codes based on compounding a low-density generator matrix (LDGM) code with a low-density parity check (LDPC) code. Our first pair of theorems establish that there exist codes from this ensemble, with all degrees remaining bounded independently of block length, that are simultaneously optimal as bot...
متن کاملA coding theorem for lossy data compression by LDPC codes
In this correspondence, low-density parity-check (LDPC) codes are applied to lossy source coding and we study how the asymptotic performance of MacKay’s LDPC codes depends on the sparsity of the parity-check matrices in the source coding of the binary independent and identically distributed (i.i.d.) source with Pr = 1 = 0 5. In the sequel, it is shown that an LDPC code with column weight (log )...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/0810.5308 شماره
صفحات -
تاریخ انتشار 2008